Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
f(0,1,x) |
→ f(x,x,x) |
| 2: |
|
f(x,y,z) |
→ 2 |
| 3: |
|
0 |
→ 2 |
| 4: |
|
1 |
→ 2 |
|
There is one dependency pair:
The approximated dependency graph contains no SCCs
and hence the TRS is trivially terminating.
Tyrolean Termination Tool (0.01 seconds)
--- May 3, 2006